3 Tournament Solutions
نویسندگان
چکیده
Perhaps one of the most natural ways to aggregate binary preferences from individual agents to a group of agents is simple majority rule, which prescribes that one alternative is socially preferred to another whenever a majority of agents prefers the former to the latter. Majority rule intuitively appeals to democratic principles, is easy to understand and—most importantly—satisfies some attractive formal properties. As seen in Chapter 2 (Zwicker, 2016), May’s Theorem shows that a number of rather weak and intuitively acceptable principles completely characterize majority rule in settings with two alternatives (May, 1952). Moreover, almost all common voting rules satisfy May’s axioms and thus coincide with majority rule in the twoalternative case. It would therefore seem that the existence of a majority of individuals preferring alternative a to alternative b signifies something fundamental and generic about the group’s preferences over a and b. We will say that alternative a dominates alternative b in such a case. As is well known from Condorcet’s paradox (see Chapter 2 (Zwicker, 2016)), the dominance relation may contain cycles. This implies that the dominance relation may not admit a maximal element and the concept of maximality as such is rendered untenable. On the other hand, Arrow writes that “one of the consequences of the assumptions of rational choice is that the choice in any environment can be determined by a knowledge of the choices in two-element environments” (Arrow, 1951, p. 16). Thus, one way to get around this problem—the one pursued in this chapter—is to take the dominance relation as given and define alternative concepts to take over the role of maximality. More precisely, we will be concerned with social choice functions (SCFs) that are based on the dominance relation only, i.e., those SCFs that Fishburn (1977) called C1 functions. Topics to be covered in this chapter include McGarvey’s Theorem, various tournament solutions (such as Copeland’s rule, the uncovered set, the top cycle, or the tournament equilibrium set), strat-
منابع مشابه
Generating Approximate Solutions to the TTP using a Linear Distance Relaxation
In some domestic professional sports leagues, the home stadiums are located in cities connected by a common train line running in one direction. For these instances, we can incorporate this geographical information to determine optimal or nearly-optimal solutions to the n-team Traveling Tournament Problem (TTP), an NP-hard sports scheduling problem whose solution is a double round-robin tournam...
متن کاملPreliminary Draft – September 13 , 2007 PageRank as a Weak Tournament Solution ?
We observe that ranking systems—a theoretical framework for web page ranking and collaborative filtering introduced by Altman and Tennenholtz—and tournament solutions—a well-studied area of social choice theory—are strongly related. This relationship permits a mutual transfer of axioms and solution concepts. As a first step, we formally analyze a tournament solution that is based on Google’s Pa...
متن کاملAn Analysis of a Reordering Operator with Tournament Selection on a GA-Hard Problem
This paper analyzes the performance of a genetic algorithm that utilizes tournament selection, one-point crossover, and a reordering operator. A model is proposed to describe the combined effect of the reordering operator and tournament selection, and the numerical solutions are presented as well. Pairwise, s-ary, and probabilistic tournament selection are all included in the proposed model. It...
متن کاملChoosing from a large tournament
A tournament can be viewed as a majority preference relation without ties on a set of alternatives. In this way, voting rules based on majority comparisons are equivalent to methods of choosing from a tournament. We consider the size of several of these tournament solutions in tournaments with a large but finite number of alternatives. Our main result is that with probability approaching one, t...
متن کاملOn the Discriminative Power of Tournament Solutions
Tournament solutions constitute an important class of social choice functions that only depend on the pairwise majority comparisons between alternatives. Recent analytical results have shown that several concepts with appealing axiomatic properties such as the Banks set or the minimal covering set tend to not discriminate at all when the tournaments are chosen from the uniform distribution. Thi...
متن کاملRobust Bounds on Choosing from Large Tournaments
Tournament solutions provide methods for selecting the best alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out any alternative in large random tournaments. Nevertheless, all analytical results thus far have assumed a rigid probabilistic model, in which either a tournament...
متن کامل